منابع مشابه
Cost Sensitive Online Multiple Kernel Classification
Learning from data streams has been an important open research problem in the era of big data analytics. This paper investigates supervised machine learning techniques for mining data streams with application to online anomaly detection. Unlike conventional machine learning tasks, machine learning from data streams for online anomaly detection has several challenges: (i) data arriving sequentia...
متن کاملOnline Cost-Sensitive Learning for Efficient Interactive Classification
A lot of practical machine learning applications deal with interactive classification problems where trained classifiers are used to help humans find positive examples that are of interest to them. Typically, these classifiers label a large number of test examples and present the humans with a ranked list to review. The humans involved in this process are often expensive domain experts with lim...
متن کاملDynamic Principal Projection for Cost-Sensitive Online Multi-Label Classification
We study multi-label classification (MLC) with three important real-world issues: online updating, label space dimensional reduction (LSDR), and cost-sensitivity. Current MLC algorithms have not been designed to address these three issues simultaneously. In this paper, we propose a novel algorithm, cost-sensitive dynamic principal projection (CS-DPP) that resolves all three issues. The foundati...
متن کاملCost-sensitive call classification
We present an efficient and effective method which extends the Boosting family of classifiers to allow the weighted classes. Typically classifiers do not treat individual classes separately. For most real world applications, this is not the case, not all classes have the same importance. The accuracy of a particular class can be more critical than others. In this paper we extend the mathematica...
متن کاملAdversarial Cost-Sensitive Classification
In many classification settings, mistakes incur different application-dependent penalties based on the predicted and actual class labels. Costsensitive classifiers minimizing these penalties are needed. We propose a robust minimax approach for producing classifiers that directly minimize the cost of mistakes as a convex optimization problem. This is in contrast to previous methods that minimize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2014
ISSN: 1041-4347
DOI: 10.1109/tkde.2013.157